COMPUTATIONALLY EFFICIENT MIN-MAX MPC
نویسندگان
چکیده
منابع مشابه
Computationally Efficient Min-max Mpc
Min-Max MPC (MMMPC) controllers (Campo and Morari, 1987) suffer from a great computational burden that is often circumvented by using upper bounds of the worst possible case of a performance index. These upper bounds are usually computed by means of LMI techniques. In this paper a more efficient approach is shown. This paper proposes a computationally efficient MMMPC control strategy in which t...
متن کاملRobust stability of min-max MPC controllers for nonlinear systems with bounded uncertainties
The closed loop formulation of the robust MPC has been shown to be a control technique capable of robustly stabilize uncertain nonlinear systems subject to constraints. Robust asymptotic stability of these controllers has been proved when the uncertainties are decaying. In this paper we extend the existing results to the case of uncertainties that decay with the state but do not tend to zero. T...
متن کاملTube based Quasi - min - max Output Feedback MPC for LPV Systems ?
Output feedback model predictive control of polytopic linear parameter varying (LPV) systems subject to input constraints is considered in this paper. The proposed control scheme incorporates robust observer and robust state feedback control. To handle disturbances and model uncertainty, disturbance invariant tube and quasi-min-max MPC are combined to achieve recursive feasibility and robust st...
متن کاملMaxNet: an efficient max-min fair allocation scheme
It has been analytically proved that both MaxNet and SumNet can achieve max-min fair allocation in static networks. In SumNet networks, such as the TCP algorithm of the current Internet, the source rate is controlled by congestion signal which is the sum of signals from all of the congested links along the path from the source to the destination. In MaxNet networks, only the most congested link...
متن کاملAn Efficient Algorithm for Running Max/min Calculation
We present a novel algorithm for calculating the running maximum or minimum value of a one-dimensional sequence over a sliding data window. The new algorithm stores a pruned ordered list of data elements that have the potential to become maxima or minima across the data window at some future time instant. This algorithm has a number of advantages over competing algorithms, including balanced co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2005
ISSN: 1474-6670
DOI: 10.3182/20050703-6-cz-1902.00477